High gradient directional solidification furnace

A high gradient directional solidification furnace is disclosed which includes eight thermal zones throughout the length of the furnace. In the hot end of the furnace, furnace elements provide desired temperatures. These elements include Nichrome wire received in a grooved tube which is encapsulated y an outer alumina core. A booster heater is provided in the hot end of the furnace which includes toroidal tungsten/rhenium wire which has a capacity to put heat quickly into the furnace. An adiabatic zone is provided by an insulation barrier to separate the hot end of the furnace from the cold end. The old end of the furnace is defined by additional heating elements. A heat transfer plate provides a means by which heat may be extracted from the furnace and conducted away through liquid cooled jackets. By varying the input of heat via the booster heater and output of heat via the heat transfer plate, a desired thermal gradient profile may be provided

General purpose rocket furnace

A multipurpose furnace for space vehicles used for material processing experiments in an outer space environment is described. The furnace contains three separate cavities designed to process samples of the widest possible range of materials and thermal requirements. Each cavity contains three heating elements capable of independent function under the direction of an automatic and programmable control system. A heat removable mechanism is also provided for each cavity which operates in conjunction with the control system for establishing an isothermally heated cavity or a wide range of thermal gradients and cool down rates. A monitoring system compatible with the rocket telemetry provides furnace performance and sample growth rate data throughout the processing cycle

Transport on complex networks: Flow, jamming and optimization

Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we address this question by using numerical models in which both structure and dynamics are controlled systematically. We consider the traffic of information packets that include driving, searching and queuing. We present the results of extensive simulations on two classes of networks; a correlated cyclic scale-free network and an uncorrelated homogeneous weakly clustered network. By measuring different dynamical variables in the free flow regime we show how the global statistical properties of the transport are related to the temporal fluctuations at individual nodes (the traffic noise) and the links (the traffic flow). We then demonstrate that these two network classes appear as representative topologies for optimal traffic flow in the regimes of low density and high density traffic, respectively. We also determine statistical indicators of the pre-jamming regime on different network geometries and discuss the role of queuing and dynamical betweenness for the traffic congestion. The transition to the jammed traffic regime at a critical posting rate on different network topologies is studied as a phase transition with an appropriate order parameter. We also address several open theoretical problems related to the network dynamics

Evaluation of a composite mobile holographic nondestructive test system

A simplified theoretical model for the interpretation of the double-exposure holographic interference fringe loci due to the general three-dimensional displacements was derived for the specific composite mobile holographic nondestructive test system. The model, representing a good approximation to a more tedious theoretical result, predicts that a combination of in-plane and out-of-plane displacements of the surface will produce concentric circular-shaped fringe patterns with locations of their center affected by the displacements. Appropriate experiments were designed and carried out for the test of the validity of the theory. These experiments include the taking of double-exposure holograms of in-plane translations and combined in-plane and out-of-plane translations. The simplified model agreed quite well with the experimental results. Experimentally observed effects due to the curvature of the test plate and the variations of the angles of incidence of the laser light suggest that in order for the simplified model to be able to predict the test results more accurately, incidence and reflection of the laser light should be chosen as nearly perpendicular to the surface of the tested object as possible

The Resonance Peak in Sr2_2RuO4_4: Signature of Spin Triplet Pairing

We study the dynamical spin susceptibility, $\chi({\bf q}, \omega)$, in the normal and superconducting state of Sr$_2$RuO$_4$. In the normal state, we find a peak in the vicinity of ${\bf Q}_i\simeq (0.72\pi,0.72\pi)$ in agreement with recent inelastic neutron scattering (INS) experiments. We predict that for spin triplet pairing in the superconducting state a {\it resonance peak} appears in the out-of-plane component of $\chi$, but is absent in the in-plane component. In contrast, no resonance peak is expected for spin singlet pairing.Comment: 4 pages, 4 figures, final versio

Dirty black holes: Entropy versus area

Considerable interest has recently been expressed in the entropy versus area relationship for ``dirty'' black holes --- black holes in interaction with various classical matter fields, distorted by higher derivative gravity, or infested with various forms of quantum hair. In many cases it is found that the entropy is simply related to the area of the event horizon: S = k A_H/(4\ell_P^2). For example, the ``entropy = (1/4) area'' law *holds* for: Schwarzschild, Reissner--Nordstrom, Kerr--Newman, and dilatonic black holes. On the other hand, the ``entropy = (1/4) area'' law *fails* for: various types of (Riemann)^n gravity, Lovelock gravity, and various versions of quantum hair. The pattern underlying these results is less than clear. This paper systematizes these results by deriving a general formula for the entropy: S = {k A_H/(4\ell_P^2)} + {1/T_H} \int_\Sigma [rho - {L}_E ] K^\mu d\Sigma_\mu + \int_\Sigma s V^\mu d\Sigma_\mu. (K^\mu is the timelike Killing vector, V^\mu the four velocity of a co--rotating observer.) If no hair is present the validity of the ``entropy = (1/4) area'' law reduces to the question of whether or not the Lorentzian energy density for the system under consideration is formally equal to the Euclideanized Lagrangian. ****** To appear in Physical Review D 15 July 1993 ****** [Stylistic changes, minor typos fixed, references updated, discussion of the Born-Infeld system excised]Comment: plain LaTeX, 17 pages, minor revision

Fluid Models of Many-server Queues with Abandonment

We study many-server queues with abandonment in which customers have general service and patience time distributions. The dynamics of the system are modeled using measure- valued processes, to keep track of the residual service and patience times of each customer. Deterministic fluid models are established to provide first-order approximation for this model. The fluid model solution, which is proved to uniquely exists, serves as the fluid limit of the many-server queue, as the number of servers becomes large. Based on the fluid model solution, first-order approximations for various performance quantities are proposed

Markov Decision Processes and Ship Handling: An Exercise in Aggregation

Summary: Operational planning in a general purpose ship terminal is treated. The decisions to be taken concern the weekly manpower capacity and the assignment of manpower and equipment to ships. As a Markov decision problem the model is very big and aggregation is desirable. As a check simulation is used, which leads to an iterative aggregation-disaggregation approach. Zusammenfassung: Diese Arbeit beschäftigt sich mit operationelle Planung in ein Schiffterminal für Stückgutbehandlung. Wöchentlich muss entschieden werden über Arbeitspotential und täglich über Zuteilung von Arbeitskräfte und Material. Das Markoffsche Entscheidungsmodell für dieses Problem ist sehr gross und man muss an Aggregation denken. Als Überprüfung wird dabei Simulation benützt und das führt zu einem iterativen Aggregation-Disaggregation Verfahren

Aggregation — Disaggregation Algorithms for Discrete Stochastic Systems

In this paper an aggregation — disaggregation method is formulated for a finite horizon Markov decision process with two-dimensional state and action spaces. This second dimension of the state and the action contains a similar type of information in which aggregation is both natural and simple. The quality of the approach is illustrated by an example